Self-stabilizing Deadlock Detection Under the OR Requirement Model
نویسندگان
چکیده
This article introduces a self-stabilizing deadlock-detection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is correct, because it does not detect false deadlocks. Because of the self-stabilization property, the algorithm supports dynamic changes in the wait-for graph on which it works, and transient faults; also, it can be started in an arbitrary state. Previous deadlock-detection algorithms for the OR model are not guaranteed to recover from transient faults, nor can they be started in an arbitrary state. Once the algorithm terminates, each process knows if it is or not deadlocked; moreover, deadlocked processes know whether they cause or only suffer from deadlock.
منابع مشابه
Dynamic Deadlock Detection under the OR Requirement Model
Deadlock detection is one of the most discussed problems in the literature. Although several algorithms have been proposed, the problem is still open. In general, the correct operation of an algorithm depends on the requirement model being considered. This article introduces a deadlockdetection algorithm for the OR model. The algorithm is complete, because it detects all deadlocks, and it is co...
متن کاملTesting Multi-agent Systems for Deadlock Detection Based on UML Models
There is a growing demand for Multi-Agent Systems (MAS) in the software industry. The autonomous agent interaction in a dynamic software environment can potentially lead to runtime behavioral failures including deadlock. In order to bring MAS to the main stream of commercial software development, the behavior of MAS must be tested and monitored against the risk of unwanted emergent behaviors in...
متن کاملSelf-Stabilizing Symmetry Breaking in Constant Space
(extended abstract) Alain Mayer Yoram Ofeky Rafail Ostrovskyz Moti Yungx Abstract We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring of identical processors, where each processor is an asynchronous probabilistic (coinipping) nite state machine which sends and receives messages. We show that the solution to this problem is equiva...
متن کاملSystematic Correct Construction of Self-stabilizing Systems: A Case Study
Design and implementation of distributed algorithms often involve many subtleties due to their complex structure, non-determinism, and low atomicity as well as occurrence of unanticipated physical events such as faults. Thus, constructing correct distributed systems has always been a challenge and often subject to serious errors. We present a methodology for component-based modeling, verificati...
متن کاملCorrectness of Self-Stabilizing Algorithms Under the Dolev Model When Adapted to Composite Atomicity Models
In this paper, we first clarify that it is not a trivial matter whether or not a selfstabilizing algorithm under the Dolev model, when adapted to a composite atomicity model, is also self-stabilizing. Then we employ a particular “simulation” approach to show that if a self-stabilizing algorithm under the Dolev model has one of two certain forms, then it is also self-stabilizing when adapted to ...
متن کامل